Optimal Estimation of Linear Functionals

In this paper we deal with the problem of estimating a ljnear functional, Nx, when given limited information on x. We show, in a very general setting, that there always exists a linear algorithm for computing Nx which yields the least possible error relative to the given information on x. Thus the search for nonlinear algorithms will not yield smaller errors than those which are achievable by linear algorithms.

A number of special examples are also discussed.

By: Charles A. Micchelli

Published in: RC5729 in 1975

LIMITED DISTRIBUTION NOTICE:

This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.

rc5729.pdf

Questions about this service can be mailed to reports@us.ibm.com .